Optimizing Surface Triangulation Via Near Isometry with Reference Meshes

نویسندگان

  • Xiangmin Jiao
  • Narasimha R. Bayyana
  • Hongyuan Zha
چکیده

Optimization of the mesh quality of surface triangulation is critical for advanced numerical simulations and is challenging under the constraints of error minimization and density control. We derive a new method for optimizing surface triangulation by minimizing its discrepancy from a virtual reference mesh. Our method is as easy to implement as Laplacian smoothing, and owing to its variational formulation it delivers results as competitive as the optimization-based methods. In addition, our method minimizes geometric errors when redistributing the vertices using a principle component analysis without requiring a CAD model or an explicit high-order reconstruction of the surface. Experimental results demonstrate the effectiveness of our method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-delaunay Meshes for Surfaces

In the Euclidean plane, a Delaunay triangulation can be characterized by the requirement that the circumcircle of each triangle be empty of vertices of all other triangles. For triangulating a surface S in R3, the Delaunay paradigm has typically been employed in the form of the restricted Delaunay triangulation, where the empty circumcircle property is defined by using the Euclidean metric in R...

متن کامل

Self-delaunay Meshes for Surfaces

In the Euclidean plane, a Delaunay triangulation can be characterized by the requirement that the circumcircle of each triangle be empty of vertices of all other triangles. For triangulating a surface S in R3, the Delaunay paradigm has typically been employed in the form of the restricted Delaunay triangulation, where the empty circumcircle property is defined by using the Euclidean metric in R...

متن کامل

Self-delaunay Meshes for Surfaces

In the Euclidean plane, a Delaunay triangulation can be characterized by the requirement that the circumcircle of each triangle be empty of vertices of all other triangles. For triangulating a surface S in R3, the Delaunay paradigm has typically been employed in the form of the restricted Delaunay triangulation, where the empty circumcircle property is defined by using the Euclidean metric in R...

متن کامل

Surface Mesh Optimization, Adaption, and Untangling with High-Order Accuracy

We investigate the problem of optimizing, adapting, and untangling a surface triangulation with high-order accuracy, so that the resulting mesh has sufficient accuracy for high-order numerical methods, such as finite element methods with quadratic or cubic elements or generalized finite difference methods. We show that low-order remeshing, which may preserve the “shape” of the surface, can unde...

متن کامل

Smoothing of Complex Surface Triangulations with Efficient Local Node Movements

This work presents a new method for quality improvement of a given surface triangulation maintaining its topology and controlling the surface approximation. The main advantage is the transformation of the 3-D problem into 2-D local parametric ones without constraints. So, the local objective function, which is defined by using algebraic quality measures, contains a barrier which automatically p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007